Optimised Kd-tree Indexing of Multimedia Data
نویسندگان
چکیده
Near neighbor searching in image databases is a multidimensional problem. The kd-tree is one of the first methods proposed for indexing multidimensional data. We describe optimizations of this method, and determine when they are appropriate. We discuss adaptations of the tree to feature extraction and indexing problems in multimedia data. Results show increased functionality and speed using the kd-tree as the index structure on a multimedia database.
منابع مشابه
An efficient nearest neighbor search in high-dimensional data spaces
Similarity search in multimedia databases requires an efficient support of nearest neighbor search on a large set of high-dimensional points. A technique applied for similarity search in multimedia databases is to transform important properties of the multimedia objects into points of a high-dimensional feature space. The feature space is usually indexed using a multidimensional index structure...
متن کاملMLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collections, time-series data, sensor data and scientific databases. Because of the curse of dimensionality, it is already known that well-known data structures like kd-tree, R-tree, and M-tree suffer in their performance over...
متن کاملBkd-Tree: A Dynamic Scalable kd-Tree
In this paper we propose a new index structure, called the Bkd-tree, for indexing large multi-dimensional point data sets. The Bkdtree is an I/O-efficient dynamic data structure based on the kd-tree. We present the results of an extensive experimental study showing that unlike previous attempts on making external versions of the kd-tree dynamic, the Bkd-tree maintains its high space utilization...
متن کاملND-Tree: Multidimensional Indexing Structure
The importance of multimedia databases has been growing over the last years in the most diverse areas of application, such as: Medicine, Geography, etc. With the growth of importance and of use, including the explosive increase of multimedia data on the Internet, comes the larger dimensions of these databases. This evolution creates the need for more efficient indexing structures in a way that ...
متن کاملA Parallel Model for Multimedia Retrieval Based on Multidimensional Signal Structure
Abstract: In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using multiresolution processing. Each multimedia data type can be represented by k-dimensional (k-d) signals in the spatio-temporal domain. [1] These k-d signals are separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using ...
متن کامل